Deterministic monotone dynamics and dominated strategies
نویسنده
چکیده
We survey and unify results on elimination of dominated strategies by monotonic dynamics and prove some new results that may be seen as dual to those of Hofbauer and Weibull (J. Econ. Theory, 1996, 558-573) on convex monotonic dynamics. Key-words: evolutionary dynamics, dominated strategies
منابع مشابه
Survival of Dominated Strategies under Evolutionary Dynamics∗
We prove that any deterministic evolutionary dynamic satisfying four mild requirements does not eliminate strictly dominated strategies in some games. We also show that existing elimination results for evolutionary dynamics are not robust to small changes in the specifications of the dynamics. Numerical analysis reveals that dominated strategies can persist at nontrivial frequencies even when t...
متن کاملTechnical supplement to “Population Games and Deterministic Evolutionary Dynamics”
After 3.3: Ordinary differential equations . . . . . . . . . . . . . . . . . . . . . . 2 Before 5.1.3: Extinction and invariance under imitative dynamics . . . . . . . . . 3 With 5.1.3: Monotone percentage growth rates and positive correlation . . . . . . 3 With 5.1.3: Rest points and restricted equilibria . . . . . . . . . . . . . . . . . . . . 5 With 5.2.2: Construction of solutions of the be...
متن کاملMathematical Model for Transmission Dynamics of Hepatitus C Virus with Optimal Control Strategies
An epidemic model with optimal control strategies was investigated for Hepatitus C Viral disease that can be transmitted through infected individuals. In this study, we used a deterministic compartmental model for assessing the effect of different optimal control strategies for controlling the spread of Hepatitus C disease in the community. Stability theory of differential equations is us...
متن کاملMonotonicity of Non-deterministic Graph Searching
In graph searching, a team of searchers is aiming at capturing a fugitive moving in a graph. In the initial variant, called invisible graph searching, the searchers do not know the position of the fugitive until they catch it. In another variant, the searchers permanently know the position of the fugitive, i.e. the fugitive is visible. This latter variant is called visible graph searching. A se...
متن کاملPopulation Games and Deterministic Evolutionary Dynamics
Population games describe strategic interactions among large numbers of small, anonymous agents. Behavior in these games is typically modeled dynamically, with agents occasionally receiving opportunities to switch strategies, basing their choices on simple myopic rules called revision protocols. Over finite time spans the evolution of aggregate behavior is well approximated by the solution of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011